Adaptive Granularity Learning Distributed Particle Swarm Optimization for Large-Scale Optimization
نویسندگان
چکیده
منابع مشابه
Adaptive range particle swarm optimization
This paper proposes a new technique for particle swarm optimization called adaptive range particle swarm optimization (ARPSO). In this technique an active search domain range is determined by utilizing the mean and standard deviation of each design variable. In the initial search stage, the search domain is explored widely. Then the search domain is shrunk so that it is restricted to a small do...
متن کاملAdaptive particularly tunable fuzzy particle swarm optimization algorithm
Particle Swarm Optimization (PSO) is a metaheuristic optimization algorithm that owes much of its allure to its simplicity and its high effectiveness in solving sophisticated optimization problems. However, since the performance of the standard PSO is prone to being trapped in local extrema, abundant variants of PSO have been proposed by far. For instance, Fuzzy Adaptive PSO (FAPSO) algorithms ...
متن کاملDistributed vs. Centralized Particle Swarm Optimization for Learning Flocking Behaviors
In this paper we address the automatic synthesis of controllers for the coordinated movement of multiple mobile robots. We use a noise-resistant version of Particle Swarm Optimization to learn in simulation a set of 50 weights of a plastic artificial neural network. Two learning strategies are applied: homogeneous centralized learning, in which every robot runs the same controller and the perfo...
متن کاملFeedback learning particle swarm optimization
In this paper, a feedback learning particle swarm optimization algorithm with quadratic inertia weight (FLPSOQIW) is developed to solve optimization problems. The proposed FLPSO-QIW consists of four steps. Firstly, the inertia weight is calculated by a designed quadratic function instead of conventional linearly decreasing function. Secondly, acceleration coefficients are determined not only by...
متن کاملLearning in Particle Swarm Optimization
This paper presents particle swarm optimization based on learning from winner particle. (PSO-WS). Instead of considering gbest and pbest particle for position update, each particle considers its distance from immediate winner to update its position. Only winner particle follow general velocity and position update equation. If this strategy performs well for the particle, then that particle upda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2021
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2020.2977956